Parallel Hierarchical Radiosity: The PIT Approach

Solving Irregular Problems through Parallel Irregular Trees

This paper presents PIT, a library for the parallelization of irregular problems on distributed memory architectures. All the strategies underlying the definition of the library can be expressed in terms of operations on a PITree, a parallel version of the tree data structure oriented to irregular problems. We consider the application of PIT to two well known irregular problems: adaptive multig...

A Parallel Approach to Hierarchical Radiosity

A parallel algorithm solving the radiosity equation is presented. It is based on the hierarchical approach (HR) 5] and realized on a massively parallel supercomputer | the ConnectionMachine 5. Our algorithm considers the HR approach as a process that manipulates an huge graph structure. Simulated annealing is used in the graph's rearranging procedure to achieve a good work-balance and nearly op...

Data-Parallel Hierarchical Link Creation for Radiosity

The efficient simulation of mutual light exchange for radiosity-like methods has been demonstrated on GPUs. However, those approaches require a suitable set of links and hierarchical data structures, prepared in an expensive preprocessing step. We present a fast, data-parallel method to create links and a compact tree of patches. We demonstrate our approach for Antiradiance and Implicit Visibil...

Parallel Hierarchical Radiosity Algorithms : Case Study on a Dsm-coma Architecture Parallel and Distributed Computing Laboratory

Spatial Partitioning For Hierarchical Radiosity

This work resides around the interface of two disciplines in computer science: computer graphics (global illumination) and parallel computing (dynamic partitioning). On the one hand an efficient algorithm for global illumination simulation – hierarchical radiosity – is examined with respect to its capability of being parallelized. On the other hand we develop a general tool T for the dynamic pa...